$M_2$-EDGE COLORING AND MAXIMUM MATCHING OF GRAPHS
نویسندگان
چکیده
منابع مشابه
Edge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملOn strong edge-coloring of graphs with maximum degree 4
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a(G). It was conjectured by Alon, Sudakov and Zaks that for any simple and finite graph G, a(G) ≤ ∆+ 2, where ∆ = ∆(G) denotes the maximum degree of G. ...
متن کاملEdge-face coloring of plane graphs with maximum degree nine
An edge-face colouring of a plane graph with edge set E and face set F is a colouring of the elements of E ∪ F so that adjacent or incident elements receive different colours. Borodin [Simultaneous coloring of edges and faces of plane graphs, Discrete Math., 128(1-3):21–33, 1994] proved that every plane graph of maximum degree ∆ > 10 can be edge-face coloured with ∆ + 1 colours. We extend Borod...
متن کاملApproximating Maximum Edge 2-Coloring in Simple Graphs
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of roughly 0.842 and runs in O(nm) time, where n (respectively, m) is the number of vertices (respectively, edges) in the input graph. The previously best ratio achieved by a polynomial-time approximation algorithm was 5...
متن کاملEdge-Coloring Bipartite Graphs
Given a bipartite graph G with n nodes, m edges and maximum degree ∆, we find an edge coloring for G using ∆ colors in time T +O(m log ∆), where T is the time needed to find a perfect matching in a k-regular bipartite graph with O(m) edges and k ≤ ∆. Together with best known bounds for T this implies an O(m log ∆ + m ∆ log m ∆ log ∆) edge-coloring algorithm which improves on the O(m log ∆+ m ∆ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2013
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v88i2.1